Trimmed trees and embedded particle systems

Trimmed Trees and Embedded Particle Systems

In a supercritical branching particle system, the trimmed tree consists of those particles which have descendants at all times. We develop this concept in the superprocess setting. For a class of continuous superprocesses with Feller underlying motion on compact spaces, we identify the trimmed tree, which turns out to be a binary splitting particle system with a new underlying motion that is a ...

Realtime Particle System Simulation and Rendering in Embedded Systems

The market for games for mobile phones/tablets is probably the fastest growing in the whole computer game industry. Although many of these games feature graphics which were out of reach for these systems not long ago, their quality is still far from what can be reached on modern PCs, and many algorithms used in PCs are a bad fit for these systems. For example, volumetric particle systems are ve...

Forest vs. Trees - Our Experience of Teaching Embedded Systems

Particle swarm optimisation of memory usage in embedded systems

In this paper, we propose a dynamic, non-dominated sorting, multiobjective particle-swarm-based optimizer, named Hierarchical Non-dominated Sorting Particle Swarm Optimizer (H-NSPSO), for memory usage optimization in embedded systems. It significantly reduces the computational complexity of others MultiObjective Particle Swarm Optimization (MOPSO) algorithms. Concretely, it first uses a fast no...

On Embedded Trees and Lattice Paths

Bouttier, Di Francesco and Guitter introduced a method for solving certain classes of algebraic recurrence relations arising the context of embedded trees and map enumeration. The aim of this note is to apply this method to three problems. First, we discuss a general family of embedded binary trees, trying to unify and summarize several enumeration results for binary tree families, and also to ...